منابع مشابه
The Complexity of the Proper Orientation Number
Graph orientation is a well-studied area of graph theory. A proper orientation of a graph G = (V,E) is an orientationD of E(G) such that for every two adjacent vertices v and u, d D (v) 6= d D (u) where d D (v) is the number of edges with head v in D. The proper orientation number of G is defined as −→χ (G) = min D∈Γ max v∈V (G) d D (v) where Γ is the set of proper orientations of G. We have χ(...
متن کاملCacti 4.0
The original CACTI tool was released in 1994 to give computer architects a fast tool to model SRAM caches. It has been widely adopted and used since. Two new versions were released to add area and active power modeling to CACTI. This new version adds a model for leakage power and updates the basic circuit structure and device parameters to better reflect the advances in scaling semiconductors w...
متن کاملStiffness Prediction of Beech Wood Flour Polypropylene Composite by using Proper Fiber Orientation Distribution Function
One of the most famous methods to predict the stiffness of short fiber composites is micromechanical modeling. In this study, a Representative Volume Element (RVE) of a beech wood flour natural composite has been designed and the orientation averaging approach has been utilized to predict its stiffness tensor. The novelty of this work is in finding the proper fiber orientation distribution func...
متن کاملDifference labelling of cacti
A graph G is a difference graph iff there exists S ⊂ IN such that G is isomorphic to the graph DG(S) = (V,E), where V = S and E = {{i, j} : i, j ∈ V ∧ |i− j| ∈ V }. It is known that trees, cycles, complete graphs, the complete bipartite graphs Kn,n and Kn,n−1, pyramids and n-sided prisms (n ≥ 4) are difference graphs (cf. [4]). Giving a special labelling algorithm, we prove that cacti with a gi...
متن کاملOn the proper orientation number of bipartite graphs
An orientation of a graph G is a digraph D obtained from G by replacing each edge by exactly one of the two possible arcs with the same endvertices. For each v ∈ V (G), the indegree of v in D, denoted by d− D (v), is the number of arcs with head v in D. An orientation D of G is proper if d− D (u) 6= d− D (v), for all uv ∈ E(G). The proper orientation number of a graph G, denoted by − →χ (G), is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.05.016